# -*- coding: UTF-8 -*-
from typing import List
from leetcode_helper import TestcaseHelper, SolutionBase


class Solution(SolutionBase):
    # 解题的方法，命名和Leetcode的保持一致即可
    def canPartition(self, nums: List[int]) -> bool:
        nums_sum = sum(nums)
        max_target = max(nums)

        if nums_sum % 2 == 1:
            return False

        target = nums_sum // 2
        if max_target > target:
            return False

        nums_count = len(nums)
        dp = [[False] * (target + 1) for _ in range(nums_count)]

        dp[0][nums[0]] = True

        for i in range(nums_count):
            dp[i][0] = True

        for i in range(1, nums_count):
            for j in range(1, target + 1):
                if dp[i-1][j]:
                    dp[i][j] = True
                elif j >= nums[i] and dp[i-1][j - nums[i]]:
                    dp[i][j] = True

                if j == target and dp[i][j]:
                    return True

        return dp[nums_count - 1][target]


if __name__ == '__main__':
    solution = Solution()

    # 按照leetcode的题目说明，将基本的test case填入
    # 每条case的最后一个元素是正确的结果，即期待的结果
    # 使用元组来保存输入的数据，期待的结果
    testcases = [
        ([1, 5, 11, 5], True),
        ([1, 2, 3, 5], False)
    ]

    for case_item in testcases:
        # 获取测试用的case和期待的执行结果
        input1 = case_item[0]
        expect = case_item[len(case_item) - 1]

        exec_result = solution.canPartition(input1)

        # 判断执行结果，输出提示信息
        check_result = solution.check_result(expect, exec_result)
        TestcaseHelper.print_case(check_result, case_item, exec_result)
